Concerning the increasingly high real-time processing requirement of space science satellite observed data, a real-time processing method of space science satellite data based on stream computing framework was proposed. Firstly, the data stream was abstractly analyzed according to the data processing characteristics of space science satellite. Then, the input and output data structures of each processing unit were redefined. Finally, the parallel data stream processing structure was designed based on the stream computing framework Storm to meet the requirements of parallel processing and distributed computing of large-scale data. The developed system for space science satellite data processing applying with this method was tested and analyzed. The results show that the data processing time is half of that of the original system under same conditions and the data localization strategy has higher throughput than round-robin strategy with the data tuple throughput increased by 29% on average. It can be seen that the use of stream computing framework can greatly shorten the data processing delay and improve the real-time performance of the space science satellite data processing system.

Concerning that the increasement of accumulated error causes serious distortion of Unmanned Aerial Vehicle (UAV) remote sensing images stitching, a projection error correction algorithm based on space intersection was proposed, Using space intersection theory, the spatial coordinates of 3D points were calculated according to correspondence points. Then all 3D points were orthographic projected onto the same space plane, and the orthographic points were projected onto the image plane to get corrected correspondence points, Finally, M-estimator Sample Consensus (MSAC) algorithm was used to estimate the homography matrix, then the stitching image was obtained. The simulation results show that this algorithm can effectively eliminate the projection error, thus achieve the purpose of inhibiting UAV remote sensing image stitching error.

This paper presented a new sorting algorithm based on bit-split quick sort that aimed to explore the algorithm which had excellent performance for large data. The algorithm split data in bit, and parallel processed the split data in combination with Java's concurrent mechanism. The data experiments show that the new sorting algorithm is significantly better than quick sort for large data sorting and owns very good parallel efficiency.